Weighted Partonomy-taxonomy Trees with Local Similarity Measures for Semantic Buyer-seller Match-making
نویسندگان
چکیده
A semantically enhanced weighted tree similarity algorithm for buyer-seller match-making is presented. First, our earlier global, structural similarity measure over (product) partonomy trees is enriched by taxonomic semantics: Inner nodes can be labeled by classes whose partial subsumption order is represented as a taxonomy tree that is used for similarity computation. In particular, the similarity of any two classes can be defined via the weighted length of the shortest path connecting them in the taxonomy. Instead of a taxonomy separate from the partonomy, we encode the taxonomy tree into the partonomy tree (as a “Classification” branch) in a way that allows us to directly reuse our partonomy similarity algorithm and to permit weighted (or 'fuzzy') taxonomic subsumption with no added effort. Second, leaf nodes can be typed and each type is associated with a local, special-purpose similarity measure realising the semantics to be invoked when computing the similarity of any two of its instances. We illustrate local similarity measures with e-Business types such as “Currency”, “Address”, “Date”, and “Price”. For example, the similarity measure on “Date”-typed leaf node labels translates various notations for date instances into a normal form from which it linearly maps any two to their similarity value. Finally, previous adjustment functions, which prevent similarity degradation for our arbitrarily wide and deep trees, are enhanced by smoother functions that evenly compensate intermediate similarity values.
منابع مشابه
A Weighted-Tree Similarity Algorithm for Multi-Agent Systems in E-Business Environments
A tree similarity algorithm for match-making of agents in e-business environments is presented. Product/service descriptions of seller and buyer agents are represented as nodelabelled, arc-labelled, arc-weighted trees. A similarity algorithm for such trees is developed as the basis for semantic match-making in a virtual marketplace. The trees are exchanged using a serialization in Object-Orient...
متن کاملMatch-Making in Bartering Scenarios
This thesis extends tree similarity based match-making from the buyer/seller situation to a scenario of bilateral bartering and multi-agent ring bartering. It is built on top of the AgentMatcher tree similarity algorithm for node-labelled, arc-labelled, arc-weighted trees. A representation of these trees in a multi-dimensional space is developed to allow efficient indexing and pruning in large ...
متن کاملSimilarity of Weighted Directed Acyclic Graphs
This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the metadata representation of buyer and seller agents, as well as a similarity and associated simplicity measure over this information. In order to make the interaction between agents more meaningful and fine-grained, we choose node-labeled, arc-labeled and arc-weighted dire...
متن کاملRange Similarity Measures Between Buyers and Sellers in e-Marketplaces
Price is the omnipresent factor that determines buyers’ and sellers’ decision-making when trading products in real and virtual marketplaces. However, since a fixed price can often lead to unsuccessful transactions, in practice market players normally have price ranges in their minds, which imply some concessions when finding potential buyer-seller matches. In this paper, we propose a price-rang...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005